Heterogeneous Search in Unstructured Peer-to-Peer Networks

نویسندگان

  • Xiuguo Bao
  • Binxing Fang
  • Mingzeng Hu
  • Binbin Xu
چکیده

Resource search or discovery is a fundamental issue in peer-to-peer (P2P) and grid studies.1 Search objects, or resources, can be cycles, storage spaces, files, services, addresses, and so on. In general, systems are employing three categories of P2P-network architectures to improve search performance: centralized (such as Napster, http://www.napster.com/), decentralized but structured (such as Chord, http://www.pdos.lcs.mit.edu/chord),2 and decentralized and unstructured (such as Gnutella, http://gnutella.wego.com/). Most popular P2P applications operate in the latter category, and grids are essentially P2P systems.3 Resource search technology in these complex, fully unstructured and decentralized P2P networks presents a great challenge to the further usability of P2P networks and grids.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structured P2P Networks in Mobile and Fixed Environments

Abstract – Peer-to-Peer (P2P) networks and their applications gain increasing importance in today’s Internet, as already today the majority of IP traffic is caused by P2P applications. Since the upcoming of Napster a lot of research has been done in this area producing interesting and promising results. Still, growing demands like less data rate consumption, faster and more reliable search resp...

متن کامل

Secure Reputation Mechanism For Unstructured Peer To Peer System

Distributed hash tables (DHTs) share storage and routing responsibility among all nodes in a peer-to-peer network. These networks have bounded path length unlike unstructured networks. Unfortunately, nodes can deny access to keys or misroute lookups. We address both of these problems through replica placement. In its simplest form, a peer-topeer network is created when two or more PCs are conne...

متن کامل

Unstructured Peer-to-Peer Networks: Topological Properties and Search Performance

Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust self-organizing P2P topologies that support efficient search. In this paper we discuss four structured and unstructured P2P models (CAN, Chord, PRU, and Hypergrid) and three characteristic search algorithms (BFS, k-Random...

متن کامل

An Efficient and Scalable Search Mechanism in Unstructured Peer to Peer Network

Peer-to-peer (P2P) network systems gain a huge popularity due to their scalability and reliability in architectures and search facilities. Basically, most of the real world P2P network is unstructured. Due to their unstructured nature it is often impossible to pre-define the searching criteria. As a solution, flooding scheme is used in most cases. But one major limitation of flooding is its que...

متن کامل

Enhancing and Analyzing Search performance in Unstructured Peer to Peer Networks Using Enhanced Guided search protocol (EGSP)

Peer-to-peer (P2P) networks establish loosely coupled application-level overlays on top of the Internet to facilitate efficient sharing of resources. It can be roughly classified as either structured or unstructured networks. Without stringent constraints over the network topology, unstructured P2P networks can be constructed very efficiently and are therefore considered suitable to the Interne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Distributed Systems Online

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2005